منابع مشابه
A Museum Cost Sharing Problem
Ginsburgh and Zang [1] consider a revenue sharing problem for the museum pass program, in which several museums jointly offer museum passes that allow visitors an unlimited access to participating museums in a certain period of time. We consider a cost sharing problem that can be regarded as the dual problem of the above revenue sharing problem. We assume that all museums are public goods and h...
متن کاملCost sharing in a job scheduling problem
A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic characterization of the Shapley value rule by introducing some fairness axioms that are new in the literature. In...
متن کاملMeta-Museum: A Supportive Augmented-Reality Environment for Knowledge Sharing
The Meta-Museum is a newly coined concept which seeks to enhance people's knowledge exploration experience in museums. The Meta-Museum blends virtual reality and arti cial intelligence technologies with conventional museums to maximize the utilization of a museum's archives and knowledge base and to provide an interactive, exciting and educational experience for visitors. The Meta-Museum concep...
متن کاملCost Sharing
The objective of cooperative game theory is to study ways to enforce and sustain cooperation among agents willing to cooperate. A central question in this field is how the benefits (or costs) of a joint effort can be divided among participants, taking into account individual and group incentives, as well as various fairness properties. In this chapter, we define basic concepts and review some o...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2011
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2011.12008